User-selectable forced contiguous data for execution of evaluation logic used in animation control

ABSTRACT

An aspect provides a computer-implemented method for constructing evaluation logic associated with an animation software package. The method comprises receiving at least one software module, the at least one software module including at least one evaluator; writing the at least one software module to at least one executable code object; accepting a signal from a user input device to enable user control over use of the one or more functions; and converting variable length data types to be input into the one or more modules into fixed-length data types in advance of providing the data types as input arguments into the one or more modules.

CROSS REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.17/379,992, entitled FORCED CONTIGUOUS DATA FOR EXECUTION OF EVALUATIONLOGIC USED IN ANIMATION CONTROL, filed Jul. 19, 2021 which claimsbenefit of the following applications: U.S. Provisional PatentApplication Ser. No. 63/056,454, entitled METHODS AND SYSTEMS FOROPERATING ANIMATION CONTROLS AND CONSTRUCTING EVALUATION LOGIC, filed onJul. 24, 2020 (WD0059PP1) and U.S. Provisional Patent Application Ser.No. 63/214,729, entitled ASSIGNING COMPUTING RESOURCES TO EXECUTION OFEVALUATORS OF IMAGE ANIMATION, filed on Jun. 24, 2021 (WD0059PP2), whichare hereby incorporated by reference as if set forth in full in thisapplication for all purposes.

This application is further related to the following U.S. Pat. No.11,281,477, entitled ASSIGNING COMPUTING RESOURCES TO EXECUTION OFEVALUATORS FOR IMAGE ANIMATION, issued on Mar. 22, 2022 (WD0059US2),which is hereby incorporated by reference as if set forth in full inthis application for all purposes.

FIELD

The present disclosure generally relates to systems, methods, and UserInterfaces (UIs) for operating animation controls and for constructingevaluation logic associated with animation. The disclosure moreparticularly relates to techniques for generating animation sequencedata in a visual content generation system. The methods and systemsdisclosed below are not limited to animation and visual content systems.The data processing techniques disclosed below, for example, may beapplied to different fields.

BACKGROUND

Visual content generation systems are used to generate imagery in theform of still images and/or video sequences of images. The still imagesand/or video sequences of images may include live action scenes obtainedfrom a live action capture system, computer generated scenes obtainedfrom an animation creation system, or a combination thereof.

An animation artist is provided with tools that allow them to specifythe imagery. Where the imagery includes computer generated scenes, theanimation artist may use various tools to specify the positions in ascene space, such as a three-dimensional coordinate system of objects.Some objects may be articulated, have multiple limbs and joints that aremovable with respect to each other, etc.

The animation artist may retrieve a representation of an articulatedobject and generate an animation sequence movement of the articulatedobject, or part thereof. Animation sequence data representing ananimation sequence may be stored in data storage, such as animationsequence storage described below.

Animation sequence data may include data time series for control pointsof an articulated object having controllable attributes. Generatinganimation sequence data may be a complicated task, when a scene callsfor animation of an articulated object.

It is an object of at least one implementation to address at least someof the aforementioned challenges.

SUMMARY

Certain implementations discussed herein facilitate use of a plugin oradd-in to a host application (e.g., a computer graphics application,such as a computer animation software package), so as to rapidly executeprocesses that are usable by the host application, e.g., to facilitatemanipulating an animation control rig. Certain implementations mayemploy an Application Programming Interface (API) for facilitatingintegrating the add-in (a plugin that may also include other plugins, asdiscussed more fully below) with the host application. Complex datastructures, such as data compounds, can be flattened and stored inblocks of contiguous memory, so as to facilitate rapid access thereto byplugin functionality, e.g., matrix operations, scaling, skinning, and soon.

Various implementations facilitate extending customizability,functionality, and flexibility of the host application, while addingperformance improvements for various complex operations.

An example method includes storing data pertaining to a computing objectin a contiguous portion of memory; and integrating one or more modulesassociated with the computing object with one or more host applications,wherein the one or more host applications include an animation softwarepackage or other graphics package.

The one or more modules may include one or more functions that areusable by the host application. A UI widget may exhibit one or more UIcontrols for enabling user control over functionality and use of the oneor more functions by the host application.

The one or more functions may include one or more evaluators and controllogic for selectively manipulating an animation control rig displayed inthe host application.

In one implementation, the one or modules include a module that islimited to receiving one or more fixed-length variables as input to anevaluator thereof. The example method may further include convertingvariable length data types to be input into the one or more modules intofixed-length data types in advance of providing the data types as inputarguments into the one or more modules, i.e., evaluators thereof.

A contiguous block of data may be aggregated among several or many datastructures, so that slowdowns from disjointed addressing are reduced oreliminated. A detail pertaining to implementing the compound datastructures may include that variable length data types (e.g., a string)are converted to fixed length types.

The term ‘comprising’ as used in this specification means ‘consisting atleast in part of’. When interpreting each statement in thisspecification that includes the term ‘comprising’, features other thanthat or those prefaced by the term may also be present. Related termssuch as ‘comprise’ and ‘comprises’ are to be interpreted in the samemanner

In an implementation the method further comprises receiving at least oneedit to the at least one executable code object in a source language;and writing the at least one edit to the at least one executable codeobject.

In an implementation the at least one software module is received via aUser Interface (UI) widget.

In an implementation receiving the at least one software modulecomprises receiving the at least one evaluator within the UI widget byone or more of: a drag-and-drop action, operation of an input device.

In an implementation receiving the at least one software modulecomprises receiving the at least one evaluator within the UI widget byretrieving, from a storage device, data representing the at least oneevaluator.

In an implementation the at least one software module includes aplurality of evaluators.

In an implementation writing the at least one software module to atleast one executable code object comprises: writing the at least onesoftware module to at least one source language code object; executingthe at least one source language code object; and on receiving aninstruction to compile the at least one source language code object,compiling the at least one source language code object to generate theat least one executable code object.

In an implementation executing the at least one source language codeobject is performed by an interpreter.

In an implementation compiling the at least one source language codeobject is performed by a compiler, the method further comprisingexecuting the at least one executable code object.

In an implementation the at least one software module includes multipledeformation processes to be applied to an input mesh, and wherein the atleast one executable code object when executed applies the multipledeformation processes as a stack to the input mesh to produce an outputmesh.

In an implementation the method further comprises scheduling executionof the at least one executable code object.

In an implementation the method further comprises on detecting that theat least one executable code object is stored on a first computingdevice, allocating resources on the first computing device to scheduleexecution of the at least one executable code object.

In an implementation the method further comprises allocating resourceson a second computing device selected from a plurality of computingdevices to schedule execution of the at least one executable codeobject.

In an implementation allocating resources on the second computing deviceis based at least partly on a location of the second computing device.

In an implementation allocating resources on the second computing deviceis based at least partly on availability of the second computing device.

BRIEF DESCRIPTION OF THE DRAWINGS

Various implementations in accordance with the present disclosure willbe described with reference to the drawings, in which:

FIG. 1 shows an example of a control rig configured to enable an artistto create animation sequence data.

FIG. 2 shows examples of animation control points associated with thecontrol rig of FIG. 1.

FIG. 3 shows an example of a user interface that may be used to authorevaluation logic associated with the animation control rig of FIG. 1.

FIG. 4 shows an example of a hierarchical node graph suitable forimplementing the control rig of FIG. 1.

FIG. 5 shows an example of a process for compiling and testingevaluation logic.

FIG. 6 shows an example of an extension that can be applied to the userinterface of FIG. 3.

FIG. 7 shows an example of allocation of memory efficiently betweendevices.

FIG. 8 is a block diagram illustrating an example computer system uponwhich computer systems disclosed below may be implemented.

FIG. 9 illustrates an example visual content generation system as mightbe used to generate imagery in the form of still images and/or videosequences of images.

FIG. 10 illustrates example modules used for allocating memory for oneor more flattened computing objects (e.g., corresponding to softwaremodules of a plugin or add-in to a host application) and accompanyingdata in a contiguous block of memory.

FIG. 11 illustrates an example method usable with the modules of FIG.10.

FIG. 12 illustrates an example computing environment that includes anadd-in or plugin to a host application, and wherein the add-in includesor leverages functionality for collecting and organizing datastructures, and/or portions thereof in local cache memory, therebyfacilitating fast access to the data structure by functionality of theadd-in.

DETAILED DESCRIPTION

In the following description, various implementations will be described.For purposes of explanation, specific configurations and details are setforth in order to provide a thorough understanding of theimplementations. However, it will also be apparent to one skilled in theart that the implementations may be practiced without the specificdetails. Furthermore, well-known features may be omitted or simplifiedin order not to obscure the implementation being described.

The present disclosure generally relates to methods and systems foroperating animation controls and for constructing evaluation logicassociated with developing animation content. The disclosure moreparticularly relates to techniques for generating animation sequencedata in a visual content generation system.

For the purposes of the present discussion, a computing environment maybe any collection of computing resources used to perform one or moretasks involving computer processing. A computer may be any processor incommunication with a memory.

A computing resource may be any component, mechanism, or capability orquantities thereof of a computing environment, including, but notlimited to, processors, memories, software applications, user inputdevices, and output devices, servers, data, and so on.

A variable may be any data container for holding data that may vary. Avariable name may be any information that can be used by a computerprocess to reference the variable and extract data therefrom.

A data structure may be any collection or organization of data and/orfunctionality. This may include computing objects, programming languageclasses, enumerated types, arrays, compound data structures, and so on.A compound data structure may be any hierarchical arrangement of ornesting of inter-related data structures.

An argument may be any input to a function, procedure, or other computerprocess. An argument description may be any information describing oneor more inputs to the function, procedure, and/or other computerprocess. Accordingly, a variable may be provided as an argument to agiven function, procedure and/or other computer process.

An evaluator may be any function, procedure, and/or other computerprocess that takes one or more arguments as input and provides one ormore outputs. Generally, in the context herein, evaluators pertain tofunctions used by computer graphics programs.

A computer graphics program may be any software program or suite ofprograms (e.g., a software package) that is adapted to facilitateadjustment and/or control of visually displayed items, e.g., itemspresented on a computer monitor and/or other display device (e.g.,television, etc.). Accordingly, animation software used to generateanimations for movies, games, videos, and so on, represents a type ofcomputer graphics software.

For clarity, certain well-known components, such as the Internet, harddrives, processors, power supplies, routers, Internet Service Providers(ISPs), middleware, and so on, are not necessarily explicitly called outin the figures. However, those skilled in the art with access to thepresent teachings will know which components to implement and how toimplement them to meet the needs of a given implementation.

FIG. 1 shows an example of a control rig 100, or animated skeleton. Thecontrol rig 100 is configured to enable an artist to create animationsequence data. Animation sequence data is typically in the form of timeseries of data for control points of an object that hasuser-controllable attributes. In some examples, the object includes ahumanoid character with limbs and joints that are movable in mannerssimilar to typical human movements.

Here, the control rig 100 represents a humanoid character, but may beconfigured to represent one or more different characters. In animplementation, the control rig 100 includes a hierarchical set ofinterconnected bones, connected by joints, forming a kinematic chain.

For example, the control rig 100 includes a thigh 102, a knee 104, alower leg 106, an ankle 108, and a foot 110, connected by joints 112,114. The control rig 100 may be employed to individually move individualbones and joints using forward kinematics to pose a character. Movingthe thigh 102 causes a movement of the lower leg 106, as the lower leg106 is connected to the thigh 102 via the knee 104. The thigh 102 andthe lower leg 106, for example, are in a parent-child relationship.Movement of the lower leg 106 is a product of movement of the thigh 102as well as movement of the lower leg 106. The control rig 100 may alsouse inverse kinematics, in which, for instance, an artist moves theankle 108. If an artist moves an ankle 108 upwards; then the knee 104consequently bends and moves upwards to accommodate a pose in which theankle 108 is at a user specified location.

The control rig 100 may be formed using a plurality of data points. Thecontrol rig 100 may be matched to a skeleton obtained from an animationsystem, or from, for example, motion capture markers or other means onreal-life actors. A live action scene of a human actor is captured by alive action capture system 902 (as shown in FIG. 9) while wearing mocap(motion capture) fiducials; for example, high-contrast markers, affixedto actor clothing. The movement of those fiducials is determined by liveaction processing system 922. An animation driver generator 944 mayconvert that movement data into specifications of how joints of anarticulated character are to move over time.

FIG. 2 shows examples of animation control points 120-124 of a skeleton200 associated with the control rig of FIG. 1. As shown in FIG. 2, arepositioned (relative to FIG. 1) control rig 200 includes a pluralityof animation control points 120-124, also simply called control points.Examples of control points are indicated at 120, 122, and 124. Forexample, in an implementation, the control rig 200 includes a firstcontrol point 120 at an ankle, which allows an animator to control themotion of a leg of the control rig 200. In another example, a secondcontrol point 122 is positioned at a lower leg of the control rig 200. Athird control point 124 is positioned at an upper leg. Different partsof the control rig 200 are associated with respective control points.

In an implementation, an artist creates an animation sequence byselecting a control point (e.g., one or more of the points 120-124and/or other points not labeled) on the control rig 200. With referenceto FIGS. 2 and 8, the control rig 200 of FIG. 2 may be displayed, forexample, on a display 812 of FIG. 8. The artist selects a control point(e.g., one or more of the points 120-124 of FIG. 2) using an inputdevice 814 of FIG. 8, and/or a cursor control 816 of FIG. 8. The controlpoints 120-124 may be displayed as extending from a characterrepresented by the control rig 200. Displaying the control points120-124 in this manner enables the artist to easily select a controlpoint.

The artist may, for example, select the control point 122 for the lowerleg, or the control point 124 for the upper leg of the control rig 200.The artist selects a position and/or location of the control point thatis different to the current position and/or location of the controlpoint. This process is known as key-framing The artist moves controls tonew positions at given times, thereby creating key poses in an animationsequence. Interpolation is performed between key poses.

In an implementation, control points may be used to control more thanone bone. For example, a control point may be used to control the upperarm and lower arm simultaneously.

In an implementation, at least one inverse kinematics operation isperformed in order to generate an animation sequence specified by theartist. For example, the artist may wish to specify that the ankle 108of the control rig 100 of FIG. 1 is to move from a first location to asecond location, resulting in the repositioned control rig 200 as shownin FIG. 2. The artist may manipulate the control point 120 to specify adesired change in ankle location.

A series of calculations is performed to determine what changes inlocation and/or orientation of parts of the control rig 100 of FIG. 1are required to result in an updated orientation shown in the updatedcontrol rig 200 of FIG. 2. For example, a new location of the firstcontrol point 120 of FIG. 2 selected by the artist may require a changein location and/or orientation of at least the thigh 102, the knee 104,the lower leg 106, the ankle 108 and the foot 110 of FIG. 1. The changesin location and/or orientation that are required to achieve a goal ofthe artist are then determined.

FIG. 3 shows an example of a user interface 300 that may be used toauthor evaluation logic and to generate an executable code object 510(as shown in FIG. 5), which may represent an evaluator. An executablecode object may be any collection of executable code that is derivedfrom functions, calls, datatypes, arguments, variables (local or globalvariables), etc. With reference to FIGS. 3 and 5, the executable codeobject 510 of FIG. 5 may be compiled into a single execution block, ormay be converted to any number of deferent types of compliable andexecutable codes, such as C++, Python, etc. In an implementation, theexecutable code block 510 of FIG. 5 comprises compiled code.

In some implementations, the executable code object 510 of FIG. 5 may beused to generate blocks of other executable code for execution before orduring runtime. Such execution blocks may be generated to assist inincreasing the speed and efficiency of operations pertaining toanimation operations, such as sketching, generating, animating,lighting, shading, skinning, etc.

In one example, the user interface 300 of FIG. 3 may be employed tocreate the executable code objects 510 of FIG. 5, which may be used tooperate animation controls and implement animation functions, such asguiding skeletal positions, and/or other functions associated with ananimation control rig, e.g., the animation control rig 100 of FIG. 1,and also may be used with other aspects of animation development, suchas lighting, physical simulation, character skinning, etc. Animationcontrols may be defined and operated on using a Graphical User Interface(GUI) via an animation software package. The animation controls may thenbe passed as inputs to evaluation logic defined in the user interface300 of FIG. 3.

In an implementation, the user interface 300 of FIG. 3 is presented on adisplay, e.g., the display 812 of FIG. 8. Inputs are received, forexample, by a user operating the input device 814 and/or cursor control816 of FIG. 8.

In an implementation the user interface 300 of FIG. 3 includes a workingcanvas 302. The working canvas 302 is configured to receive evaluationlogic from a user. Evaluation logic may include, for example, buildingblocks involving math, geometry, drawing and algorithms Evaluation logicmay also include user authored functions written in a source languagesuch as C++, Visual Basic, Python, and the like.

In an implementation, the working canvas 302 is configured to enable auser to populate the working canvas 302 using the input device 814 ofFIG. 8, such as a keyboard, mouse, or other input mechanism. The usermay, for example, operate the input device 814 of FIG. 8 to enter textinto the working canvas 302 of FIG. 3. The user may also select and copytext into a main memory 806 of FIG. 8, and then paste the resultingcopied text into the working canvas 302 of FIG. 3.

Alternatively or additionally, the working canvas 302 of FIG. 3 isconfigured to be populated by a user operating the cursor control 816and input device 814 of FIG. 8, so as to enable performing adrag-and-drop action on components from other windows or within the userinterface 300 of FIG. 3. These components may include graphical objects,such as nodes from a visual graph, text, or a combination of graphicalobjects and text.

In an implementation, the working canvas 302 and other components withinthe user interface 300 are configured to be populated by retrieving,from the storage device 810 and/or main memory 806 of FIG. 8, datarepresenting a stored executable code object.

The working canvas 302 of FIG. 3 may include controls configured toreceive a user selection to expand or collapse at least some displayedlines of code. For example, the user may wish to expand all functioncalls so that they may be viewed in the working canvas 302.Alternatively, the user may wish to hide all entries in a conditionalselection state. The user may select a control that causes at least someof the entries in the conditional to be collapsed or hidden.

The user interface 300 of FIG. 3 includes an explorer panel 304. Theexecutable code entered into the working canvas 302 may includefunctions, datatypes, or the like. In an implementation, the explorerpanel 304 includes search bar 306 that is configured to receive a usersearch query for at least one function or datatype. The search query isexecuted against a library of stored functions, datatypes, data, etc.The results of the user query may be displayed within the explorer panel304, e.g., below the search bar 306.

In an implementation, the explorer panel 304 is configured to receive auser selection of a function or datatype that is included in the resultsof the user query. The selected function or datatype may be dragged anddropped by the user into the working canvas 302. The working canvas 302may be configured to receive a user selection for the function ordatatype of a location within code displayed in the working canvas 302.For example, the user may drop a selected function, datatype, etc., at aselected location within the code.

The user interface 300 may include an arguments panel 308. Thisarguments panel 308 displays data that is visible to functions, modules,and components having access to the code displayed in working canvas302. The arguments panel 308 may facilitate making data visible to thehost application and accompanying functions and modules, and optionally,to other functions/modules of other software applications. The argumentspanel 308 may display, for example, an argument name, whether or not theargument value is constant or mutable, an associated processor forexample CPU, and a datatype for example ‘int’.

The user interface 300 may include a persistent variables panel 310 thatis configured to display variables that are global in nature. In animplementation, persistent variables remain in use and keep theirrespective values over multiple executions of the associated evaluationlogic that makes use of the variables. Persistent variables are nottypically shared between different characters.

The user interface 300 may also include a documentation panel 312. In animplementation, the documentation panel 312 displays any documentationassociated with a selected function. For example, the user interface 300may receive a user selection of a function. The documentation panel 312displays documentation associated with the function that user selected.

In an implementation evaluation logic is executed in a linear fashion,e.g., from top to bottom. The evaluation logic that is displayed inworking canvas 302 is packaged into an executable code object. Examplesof how such executable code objects are manipulated are furtherdescribed below.

FIG. 4 shows an example of a hierarchical node graph 400 that issuitable for implementing the control rig 100 of FIG. 1 and the controlrig 200 of FIG. 2. The node graph 400 includes a plurality of nodes,examples of which are shown at 402, 404, and 406. At least some of thenodes 402-406 are associated with at least one input and at least oneoutput.

In an implementation, one or more nodes of the hierarchical node graph400 represent respective animation control points of the control rig 100of FIG. 1. Outputs from individual nodes may include, for instance, thesolved positions of each joint angle and bone position in the kinematicchain. In inverse kinematics, the new joint angles and positions aredetermined relative to the control input. Inputs to the individual nodesinclude the new position of a member that is then used to calculate theposition of the other members of the skeleton and the associated jointangles. For example, moving the hand from a first position resting onthe ground to a new position above the ground will be used to determinethe position of the forearm, upper arm, and elbow, and shoulder.

In an implementation, the user interface 300 of FIG. 3 is configured toenable a user to easily construct evaluation logic. For example, theuser may populate the working canvas 302 with evaluation logic using oneor more input devices (e.g., the input device 814 of FIG. 8). The usermay, for example, operate the input device 814 of FIG. 8 to enter textinto the working canvas 302 of FIG. 3. The user may also select and copytext into the main memory 806 of FIG. 8, and then paste the copied textinto the working canvas 302 of FIG. 3.

Alternatively or additionally, the working canvas 302 is configured tobe populated by a user operating the cursor control 816 and input device814 of FIG. 8 to perform a drag-and-drop action on components from otherwindows or within the user interface 300 of FIG. 3. These components mayinclude graphical objects, such as nodes, from a visual graph, text, ora combination of graphical objects and text.

In an implementation, working canvas 302 and other components withinuser interface 300 are configured to be populated by retrieving, fromstorage device 810 and/or main memory 806, data representing evaluationlogic. Items may be dragged and dropped from the explorer panel 304and/or the arguments panel 308 of FIG. 3 into other areas of the userinterface 300, such as into the working canvas 302.

An executable code object may create a module that is saved and reused.For example, the created module may be made available to other users.Some of the modules may include multiple evaluators. The user interface300 is configured to enable at least some of the evaluators from amodule to be reused across different modules.

In an implementation, the user interface 300 is configured to writemodules that are authored in the workpad 302 to a plugin. One example ofa plugin is a shared library of executable code obtained by compiling asource language or lower level programming language such as C++. Aplugin may describe evaluators and data similar to a module. However, asophisticated user is able to edit and author source code for a pluginthat is then compiled and made available to other users.

A user, for example, may author evaluation logic using high levelmodules. The high level modules may provide a level of abstractionand/or constraint to the user. Alternatively or additionally, the usermay author evaluation logic as plugins in a lower level source language.The lower level source language generally imposes fewer constraints onthe user. Modules and/or plugins are available for reuse by other users,for example, to add new data types and/or functions. The evaluators of aplugin may also be used within a module.

In an implementation, the user interface 300 of FIG. 3 allows for thecreation of compound data types. A compound data type may refer to, forexample, a film or motion picture.

In an implementation, modules associated with the user interface 300 areconfigured to arrange compounds (i.e., compound data types) into oneblock of memory, for example, as a single data structure, therebyspeeding up data access.

FIG. 5 shows an example of a process 500 for compiling and testingevaluation logic. In an implementation, at least one data file isauthored in source code 502. An example of a source code language isC++. The process 500 writes at least one software module to at least oneexecutable code object.

In an implementation, multiple data files in the source code 502 areassociated with respective functions and data types. The data files areconfigured so as to annotate the functions and data types with which thedata files are associated. The data files and/or software modules arewritten to at least one source language object.

In an implementation, the process 500 includes an interpreter 504 aspart of a build process. The source language object(s), in the form ofsource code 502, is passed to the interpreter 504. One example of aninterpreter 504 is the CLING™ interpreter. The interpreter 504 processesthe source language code object(s). In an implementation, theinterpreter 504 highlights any errors in source code 502 before sourcecode 502 is compiled.

In an implementation, interpreter 504 generates expanded source code506, which may then be automatically passed to a compiler 508. Incertain implementations, a user may have an option to selectivelycontrol passage of the expanded source code 506 to the compiler 508.

Upon receiving a user instruction to compile the source language codeobject(s) 502 and/or the expanded source code 506, the compiler 508 thencompiles the source language code object(s) and/or expanded source code506 to generate at least one executable code object 510. In certainimplementations, the compiler 508 may be implemented using the CLANG™compiler. The compiler 508 generates executable code object(s) 510 thatis/are stored for either immediate use or subsequent use.

The process 500 may potentially reduce the need to frequently restartcompilation during software development. Changes to compiled code can bemade on the fly, in the same way as changes to code that is interpreted.

FIG. 6 shows an example of an extension 600 that can be applied to theuser interface 300 of FIG. 3.

Various animation creation tools may be used to input a mesh, takedeformations from an artist, then provide an output mesh. Because of theprocessing flow back and forth between various memories when uploadingand downloading the mesh, processing is potentially slow. Accordingly,real-time processing can be problematic.

For example, an input mesh 601 that requires a deformation has to beuploaded to a Graphics Processing Unit (GPU), e.g., a GPU 614, using afirst deformation process 602 running on the GPU 614. A first outputmesh 603 of the first deformation process is then downloaded back to thefirst CPU 600. When multiple deformation processes are required to beoperated on a mesh, multiple upload and download operations would haveto be performed, which may decrease processing efficiency.

In this case, the first output mesh 603 is uploaded to the GPU for asecond deformation process 604. A second output mesh 605 is thendownloaded back to the first CPU 600. Any further deformation processeswould require the second output mesh 605 to be re-uploaded to the GPU614.

A deformer stack process 612 may represent a combination of multipledeformation processes, such as first deformation process 602 and seconddeformation process 604, within the GPU 614. The deformer stack 612operates on an input mesh 611 to produce a final output mesh 613. In theexample where deformation processes 602 and 604 are required, the finaloutput mesh 613 is equivalent to second output mesh 605.

A ‘stack’ may refer to a chain of deformations presented as a list ofdeformers. The combination of multiple deformers prevents multipleoutput meshes 603 or 605 from having to be downloaded from and uploadedback to the GPU for a chain of deformations. In an implementation, thedeformer stack 612 may be authored within user interface 300 of FIG. 3.

FIG. 7 shows an example of allocation of computing resources, such asmemory, efficiently between devices. A first computing device 700represents an example of a computer system, such as a computer system800 of FIG. 8. The first computing device 700 includes a main memory702, processor 704, and GPU 706. The first computing device 700 isconnected to further devices 708, 710, and 712, for example, via anetwork link, such as a network link 820 of FIG. 8.

In an implementation, the first computing device 700 is provided with anapplication programming interface (API) 714 that is configured to enableparallel and/or concurrent computing. For example, computing devices700, 708, 710 and 712, together with the API 714, may be configured as aparallel and/or concurrent computing platform and API model, such as theCUDA™ model. The API 714 is configured to facilitate schedulingcomputations on multiple computing devices. In an implementation, aCUDA™ API is implemented on at least one of individual devices 700, 708,710, 712.

The first computing device 700 may receive executable code objects asdescribed above. The executable code objects are initially stored in themain memory 702 before being copied to the GPU 706. The CPU/processor704 initiates the GPU compute kernel.

In some situations, the executable code objects are stored on the deviceon which the executable code objects are to be executed. For example ifthe executable code objects are stored on device 700, the resources maybe allocated on device 700 to schedule execution of the executable codeobjects.

In other situations, it is necessary to transfer the executable codeobjects to another device. In such situations, the API 714 distributesthe processing load of the executable code objects by allocatingexecution of the executable code objects among one or more of: thecomputing devices 708, 710, and 712.

Outputs from computing devices 708, 710 and/or 712 are collated andstored in the main memory 702 of the first computing device 700.

In an implementation the process for allocation of processing loadsbetween the computing devices 700, 708, 710 and/or 712 is/are at leastpartially automated. A user operating, for example, the user interface300 of FIG. 3, is not required to manually allocate processor loads tovarious computing devices.

In an implementation the API 714 is configured to allocate resourcesbased at least partly on respective locations of computing devices. Forexample, the API 714 could allocate processing requests to all deviceswithin a predefined radius in order to reduce or minimize networklatency.

In an implementation, the API 714 is configured to allocate resourcesbased at least partly on availability. For example, the API 714 couldallocate more processing requests to a computing device that is idle andallocate fewer processing requests to a device that is already in heavyuse.

According to one implementation, the techniques described herein areimplemented by one or more generalized computing systems programmed toperform the techniques pursuant to program instructions in firmware,memory, other storage, or a combination. Special-purpose computingdevices may be used, such as desktop computer systems, portable computersystems, handheld devices, networking devices or any other device thatincorporates hard-wired and/or program logic to implement thetechniques.

For example, FIG. 8 illustrates a block diagram that illustrates acomputer system 800 upon which the systems and methods described aboveand/or visual content generation system 900 of FIG. 9 may beimplemented. The computer system 800 includes a bus 802 or othercommunication mechanism for communicating information, and a processor804 coupled to the bus 802 for processing information. The processor 804may be, for example, a general purpose microprocessor.

The computer system 800 also includes a main memory 806, such as arandom access memory (RAM) or other dynamic storage device, coupled tothe bus 802 for storing information and instructions to be executed bythe processor 804. The main memory 806 may also be used for storingtemporary variables or other intermediate information during executionof instructions to be executed by the processor 804. Such instructions,when stored in non-transitory storage media accessible to the processor804, render the computer system 800 into a special-purpose machine thatis customized to perform the operations specified in the instructions.

The computer system 800 further includes a read only memory (ROM) 808 orother static storage device coupled to the bus 802 for storing staticinformation and instructions for the processor 804. A storage device810, such as a magnetic disk or optical disk, is provided and coupled tothe bus 802 for storing information and instructions.

The computer system 800 may be coupled via the bus 802 to a display 812,such as a computer monitor, for displaying information to a computeruser. An input device 814, including alphanumeric and other keys, iscoupled to the bus 802 for communicating information and commandselections to the processor 804. Another type of user input device is acursor control 816, such as a mouse, a trackball, or cursor directionkeys for communicating direction information and command selections tothe processor 804 and for controlling cursor movement on the display812. This input device typically has two degrees of freedom in two axes,a first axis (e.g., x) and a second axis (e.g., y), that allows thedevice to specify positions in a plane.

The computer system 800 may implement the techniques described hereinusing customized hard-wired logic, one or more ASICs or FPGAs, firmwareand/or program logic which in combination with the computer systemcauses or programs the computer system 800 to be a special-purposemachine. According to one implementation, the techniques herein areperformed by the computer system 800 in response to the processor 804executing one or more sequences of one or more instructions contained inthe main memory 806. Such instructions may be read into the main memory806 from another storage medium, such as the storage device 810.Execution of the sequences of instructions contained in the main memory806 causes the processor 804 to perform the process steps describedherein. In alternative implementations, hard-wired circuitry may be usedin place of or in combination with software instructions.

The term “storage media” as used herein refers to any non-transitorymedia that store data and/or instructions that cause a machine tooperation in a specific fashion. Such storage media may includenon-volatile media and/or volatile media. Non-volatile media includes,for example, optical or magnetic disks, such as the storage device 810.Volatile media includes dynamic memory, such as the main memory 806.Common forms of storage media include, for example, a floppy disk, aflexible disk, hard disk, solid state drive, magnetic tape, or any othermagnetic data storage medium, a CD-ROM, any other optical data storagemedium, any physical medium with patterns of holes, a RAM, a PROM, anEPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge.

Storage media is distinct from but may be used in conjunction withtransmission media. Transmission media participates in transferringinformation between storage media. For example, transmission mediaincludes coaxial cables, copper wire, and fiber optics, including thewires that include the bus 802. Transmission media can also take theform of acoustic or light waves, such as those generated duringradio-wave and infra-red data communications.

Various forms of media may be involved in carrying one or more sequencesof one or more instructions to the processor 804 for execution. Forexample, the instructions may initially be carried on a magnetic disk orsolid state drive of a remote computer. The remote computer can load theinstructions into its dynamic memory and send the instructions over anetwork connection. A modem or network interface local to the computersystem 800 can receive the data. The bus 802 carries the data to themain memory 806, from which the processor 804 retrieves and executes theinstructions. The instructions received by the main memory 806 mayoptionally be stored on the storage device 810 either before or afterexecution by the processor 804.

The computer system 800 also includes a communication interface 818coupled to the bus 802. The communication interface 818 provides atwo-way data communication coupling to a network link 820 that isconnected to a local network 822. For example, the communicationinterface 818 may be an integrated services digital network (ISDN) card,cable modem, satellite modem, or a modem to provide a data communicationconnection to a corresponding type of telephone line. Wireless links mayalso be implemented. In any such implementation, the communicationinterface 818 sends and receives electrical, electromagnetic, or opticalsignals that carry digital data streams representing various types ofinformation.

The network link 820 typically provides data communication through oneor more networks to other data devices. For example, the network link820 may provide a connection through the local network 822 to a hostcomputer 824 or to data equipment operated by an Internet ServiceProvider (ISP) 826. The ISP 826 in turn provides data communicationservices through the world wide packet data communication network nowcommonly referred to as the “Internet” 828. The local network 822 andInternet 828 both use electrical, electromagnetic, or optical signalsthat carry digital data streams. The signals through the variousnetworks and the signals on the network link 820 and through thecommunication interface 818, which carry the digital data to and fromthe computer system 800, are example forms of transmission media.

The computer system 800 can send messages and receive data, includingprogram code, through the network(s), the network link 820, andcommunication interface 818. In the Internet example, a server 830 mighttransmit a requested code for an application program through theInternet 828, ISP 826, local network 822, and communication interface818. The received code may be executed by the processor 804 as it isreceived, and/or stored in the storage device 810, or other non-volatilestorage for later execution.

For example, FIG. 9 illustrates the example visual content generationsystem 900 as might be used to generate imagery in the form of stillimages and/or video sequences of images. The visual content generationsystem 900 might generate imagery of live action scenes, computergenerated scenes, or a combination thereof. In a practical system, usersare provided with tools that allow them to specify, at high levels andlow levels where necessary, what is to go into that imagery. Forexample, a user, such as an animation artist, might use the visualcontent generation system 900 to capture interaction between two humanactors performing live on a sound stage and replace one of the humanactors with a computer-generated anthropomorphic non-human being thatbehaves in ways that mimic the replaced human actor's movements andmannerisms, and then add in a third computer-generated character andbackground scene elements that are computer-generated, all in order totell a desired story or generate desired imagery.

Still images that are output by the visual content generation system 900might be represented in computer memory as pixel arrays, such as atwo-dimensional array of pixel color values, each associated with apixel having a position in a two-dimensional image array. Pixel colorvalues might be represented by three or more (or fewer) color values perpixel, such as a red value, a green value, and a blue value (e.g., inRGB format). Dimension of such a two-dimensional array of pixel colorvalues might correspond to a preferred and/or standard display scheme,such as 1920 pixel columns by 1280 pixel rows Images might or might notbe stored in a compressed format, but either way, a desired image may berepresented as a two-dimensional array of pixel color values. In anothervariation, images are represented by a pair of stereo images forthree-dimensional presentations and in other variations, some or all ofan image output might represent three-dimensional imagery instead ofjust two-dimensional views.

A stored video sequence might include a plurality of images such as thestill images described above, but where each image of the plurality ofimages has a place in a timing sequence and the stored video sequence isarranged so that when each image is displayed in order, at a timeindicated by the timing sequence, the display presents what appears tobe moving and/or changing imagery. In one representation, each image ofthe plurality of images is a video frame having a specified frame numberthat corresponds to an amount of time that would elapse from when avideo sequence begins playing until that specified frame is displayed. Aframe rate might be used to describe how many frames of the stored videosequence are displayed per unit time. Example video sequences mightinclude 24 frames per second (24 FPS), 50 FPS, 140 FPS, or other framerates. In some implementations, frames are interlaced or otherwisepresented for display, but for the purpose of clarity of description, insome examples, it is assumed that a video frame has one specifieddisplay time and it should be understood that other variations arepossible.

One method of creating a video sequence is to simply use a video camerato record a live action scene, i.e., events that physically occur andcan be recorded by a video camera. The events being recorded can beevents to be interpreted as viewed (such as seeing two human actors talkto each other) and/or can include events to be interpreted differentlydue to clever camera operations (such as moving actors about a stage tomake one appear larger than the other despite the actors actually beingof similar build, or using miniature objects with other miniatureobjects so as to be interpreted as a scene containing life-sizedobjects).

Creating video sequences for story-telling or other purposes often callsfor scenes that cannot be created with live actors, such as a talkingtree, an anthropomorphic object, space battles, and the like. Such videosequences might be generated computationally rather than capturing lightfrom live scenes. In some instances, an entirety of a video sequencemight be generated computationally, as in the case of acomputer-animated feature film. In some video sequences, it is desirableto have some computer-generated imagery and some live action, perhapswith some careful merging of the two.

While computer-generated imagery might be creatable by manuallyspecifying each color value for each pixel in each frame, this is likelytoo tedious to be practical. As a result, a creator uses various toolsto specify the imagery at a higher level. As an example, an artist mightspecify the positions in a scene space, such as a three-dimensionalcoordinate system, of objects and/or lighting, as well as a cameraviewpoint, and a camera view plane. Taking all of that as inputs, arendering engine may compute each of the pixel values in each of theframes. In another example, an artist specifies position and movement ofan articulated object having some specified texture rather thanspecifying the color of each pixel representing that articulated objectin each frame.

In a specific example, a rendering engine performs ray tracing wherein apixel color value is determined by computing which objects lie along aray traced in the scene space from the camera viewpoint through a pointor portion of the camera view plane that corresponds to that pixel. Forexample, a camera view plane might be represented as a rectangle havinga position in the scene space that is divided into a grid correspondingto the pixels of the ultimate image to be generated, and if a raydefined by the camera viewpoint in the scene space and a given pixel inthat grid first intersects a solid, opaque, blue object, that givenpixel is assigned the color blue. Of course, for moderncomputer-generated imagery, determining pixel colors—and therebygenerating imagery—can be more complicated, as there are lightingissues, reflections, interpolations, and other considerations.

As illustrated in FIG. 9, a live action capture system 902 captures alive scene that plays out on a stage 904. The live action capture system902 is described herein in greater detail, but might include computerprocessing capabilities, image processing capabilities, one or moreprocessors, program code storage for storing program instructionsexecutable by the one or more processors, as well as user input devicesand user output devices, not all of which are shown.

In a specific live action capture system, cameras 906(1) and 906(2)capture the scene, while in some systems, there might be other sensor(s)908 that capture information from the live scene (e.g., infraredcameras, infrared sensors, motion capture (“mo-cap” or “mocap”detectors, etc.). On the stage 904, there might be human actors, animalactors, inanimate objects, background objects, and possibly an objectsuch as a green screen 910 that is designed to be captured in a livescene recording in such a way that it is easily overlaid withcomputer-generated imagery. The stage 904 might also contain objectsthat serve as fiducials, such as fiducials 912(1)-(3), which might beused post-capture to determine where an object was during capture. Alive action scene might be illuminated by one or more lights, such as anoverhead light 914.

During or following the capture of a live action scene, the live actioncapture system 902 might output live action footage to a live actionfootage storage 920. A live action processing system 922 might processlive action footage to generate data about that live action footage andstore that data into a live action metadata storage 924. The live actionprocessing system 922 might include computer processing capabilities,image processing capabilities, one or more processors, program codestorage for storing program instructions executable by the one or moreprocessors, as well as user input devices and user output devices, notall of which are shown. The live action processing system 922 mightprocess live action footage to determine boundaries of objects in aframe or multiple frames, determine locations of objects in a liveaction scene, where a camera was relative to some action, distancesbetween moving objects and fiducials, etc. Where elements are sensed ordetected, the metadata might include location, color, and intensity ofthe overhead light 914, as that might be useful in post-processing tomatch computer-generated lighting on objects that are computer-generatedand overlaid on the live action footage. The live action processingsystem 922 might operate autonomously, perhaps based on predeterminedprogram instructions, to generate and output the live action metadataupon receiving and inputting the live action footage. The live actionfootage can be camera-captured data as well as data from other sensors.

An animation creation system 930 is another part of the visual contentgeneration system 900. The animation creation system 930 might includecomputer processing capabilities, image processing capabilities, one ormore processors, program code storage for storing program instructionsexecutable by the one or more processors, as well as user input devicesand user output devices, not all of which are shown. The animationcreation system 930 might be used by animation artists, managers, andothers to specify details, perhaps programmatically and/orinteractively, of imagery to be generated. From user input and data froma database or other data source, indicated as a data store 932, theanimation creation system 930 might generate and output datarepresenting objects (e.g., a horse, a human, a ball, a teapot, a cloud,a light source, a texture, etc.) to an object storage 934, generate andoutput data representing a scene into a scene description storage 936,and/or generate and output data representing animation sequences to ananimation sequence storage 938.

Scene data might indicate locations of objects and other visualelements, values of their parameters, lighting, camera location, cameraview plane, and other details that a rendering engine 950 might use torender CGI imagery. For example, scene data might include the locationsof several articulated characters, background objects, lighting, etc.specified in a two-dimensional space, three-dimensional space, or otherdimensional space (such as a 2.5-dimensional space, three-quarterdimensions, pseudo-3D spaces, etc.) along with locations of a cameraviewpoint and view place from which to render imagery. For example,scene data might indicate that there is to be a red, fuzzy, talking dogin the right half of a video and a stationary tree in the left half ofthe video, all illuminated by a bright point light source that is aboveand behind the camera viewpoint. In some cases, the camera viewpoint isnot explicit, but can be determined from a viewing frustum. In the caseof imagery that is to be rendered to a rectangular view, the frustumwould be a truncated pyramid. Other shapes for a rendered view arepossible and the camera view plane could be different for differentshapes.

The animation creation system 930 might be interactive, allowing a userto read in animation sequences, scene descriptions, object details, etc.and edit those, possibly returning them to storage to update or replaceexisting data. As an example, an operator might read in objects fromobject storage into a baking processor that would transform thoseobjects into simpler forms and return those to the object storage 934 asnew or different objects. For example, an operator might read in anobject that has dozens of specified parameters (movable joints, coloroptions, textures, etc.), select some values for those parameters andthen save a baked object that is a simplified object with now fixedvalues for those parameters.

Rather than have to specify each detail of a scene, data from the datastore 932 might be used to drive object presentation. For example, if anartist is creating an animation of a spaceship passing over the surfaceof the Earth, instead of manually drawing or specifying a coastline, theartist might specify that the animation creation system 930 is to readdata from the data store 932 in a file containing coordinates of Earthcoastlines and generate background elements of a scene using thatcoastline data.

Animation sequence data might be in the form of time series of data forcontrol points of an object that has attributes that are controllable.For example, an object might be a humanoid character with limbs andjoints that are movable in manners similar to typical human movements.An artist can specify an animation sequence at a high level, such as“the left hand moves from location (X1, Y1, Z1) to (X2, Y2, Z2) overtime T1 to T2”, at a lower level (e.g., “move the elbow joint 2.5degrees per frame”) or even at a very high level (e.g., “character Ashould move, consistent with the laws of physics that are given for thisscene, from point P1 to point P2 along a specified path”).

Animation sequences in an animated scene might be specified by whathappens in a live action scene. An animation driver generator 944 mightread in live action metadata, such as data representing movements andpositions of body parts of a live actor during a live action scene, andgenerate corresponding animation parameters to be stored in theanimation sequence storage 938 for use in animating a CGI object. Thiscan be useful where a live action scene of a human actor is capturedwhile wearing mo-cap fiducials (e.g., high-contrast markers outsideactor clothing, high-visibility paint on actor skin, face, etc.) and themovement of those fiducials is determined by the live action processingsystem 922. The animation driver generator 944 might convert thatmovement data into specifications of how joints of an articulated CGIcharacter are to move over time.

A rendering engine 950 can read in animation sequences, scenedescriptions, and object details, as well as rendering engine controlinputs, such as a resolution selection and a set of renderingparameters. Resolution selection might be useful for an operator tocontrol a trade-off between speed of rendering and clarity of detail, asspeed might be more important than clarity for a movie maker to test aparticular interaction or direction, while clarity might be moreimportant that speed for a movie maker to generate data that will beused for final prints of feature films to be distributed. The renderingengine 950 might include computer processing capabilities, imageprocessing capabilities, one or more processors, program code storagefor storing program instructions executable by the one or moreprocessors, as well as user input devices and user output devices, notall of which are shown.

The visual content generation system 900 can also include a mergingsystem 960 that merges live footage with animated content. The livefootage might be obtained and input by reading from the live actionfootage storage 920 to obtain live action footage, by reading from thelive action metadata storage 924 to obtain details such as presumedsegmentation in captured images segmenting objects in a live actionscene from their background (perhaps aided by the fact that the greenscreen 910 was part of the live action scene), and by obtaining CGIimagery from the rendering engine 950.

A merging system 960 might also read data from a rulesets formerging/combining storage 962. A very simple example of a rule in aruleset might be “obtain a full image including a two-dimensional pixelarray from live footage, obtain a full image including a two-dimensionalpixel array from the rendering engine 950, and output an image whereeach pixel is a corresponding pixel from the rendering engine 950 whenthe corresponding pixel in the live footage is a specific color ofgreen, otherwise output a pixel value from the corresponding pixel inthe live footage.”

The merging system 960 might include computer processing capabilities,image processing capabilities, one or more processors, program codestorage for storing program instructions executable by the one or moreprocessors, as well as user input devices and user output devices, notall of which are shown. The merging system 960 might operateautonomously, following programming instructions, or might have a userinterface or programmatic interface over which an operator can control amerging process. In some implementations, an operator can specifyparameter values to use in a merging process and/or might specifyspecific tweaks to be made to an output of the merging system 960, suchas modifying boundaries of segmented objects, inserting blurs to smoothout imperfections, or adding other effects. Based on its inputs, themerging system 960 can output an image to be stored in a static imagestorage 970 and/or a sequence of images in the form of video to bestored in an animated/combined video storage 972.

Thus, as described, the visual content generation system 900 can be usedto generate video that combines live action with computer-generatedanimation using various components and tools, some of which aredescribed in more detail herein. While the visual content generationsystem 900 might be useful for such combinations, with suitablesettings, it can be used for outputting entirely live action footage orentirely CGI sequences. The code may also be provided and/or carried bya transitory computer readable medium, e.g., a transmission medium suchas in the form of a signal transmitted over a network.

FIG. 10 illustrates example modules 10-22 used for allocating memory forone or more flattened computing objects (e.g., corresponding to softwaremodules of a plugin to a host application) and accompanying data in acontiguous block of memory 12.

In the example implementation, one or more software modules of a pluginor add-in to a host application (e.g., an animation and/or graphicssoftware program and/or package) are flattened into a flat file, e.g.,via functionality of an interpreter 10.

The example interpreter 10 includes a memory allocation controller 14that communicates with an operating system 16 used by a host application(e.g., a graphics application, such as an animation software package),so as to facilitate allocating at least a portion of resulting flattenedcomputing objects 18 in the continuous memory block 12.

The flattened computing objects 18 may include functions and associatedpointers 20 and data 22 used by the functions. Storing the data 22 inthe contiguous memory block 18 in proximity to the functions 20facilitates rapid access to the data 22 by the evaluators 20.

Accordingly, certain implementations discussed herein facilitate fastexecution of processes of a plugin or add-in to a host application, duein part to the way data is stored in contiguous blocks of Random AccessMemory (RAM) and/or cache memory (e.g., level 1, 2, 3, etc. cache).

A contiguous block of data may be aggregated among several or many datastructures so that slowdowns from disjointed addressing are eliminated.A detail in implementing the contiguous memory blocks includes thatvariable length data types (e.g., a string) may first be converted tofixed length types.

FIG. 11 illustrates an example method 30 usable with the modules of FIG.10. The example method 30 facilitates implementing evaluation logicassociated with a host application, via a plugin or add-in to the hostapplication.

A first step 32 includes collapsing one or more computing objects, e.g.,software modules, into a flat file.

A second step 34 includes storing data pertaining to a computing objectin portion of contiguous memory via a flat file.

A third step 36 includes integrating one or more modules associated withthe computing object with one or more host applications, wherein the oneor more host applications include an animation software package.

Note that the method 30 may be modified, without departing from thescope of the present teachings. For instance, the method 30 may furtherspecify that the one or more modules include one or more functionsusable via the host application.

The example method 30 may further include a step of providing a UIwidget with one or more UI controls for enabling user control overfunctionality and use of the one or more functions by the hostapplication.

The one or more functions may include one or more evaluators and controllogic for selective manipulation of an animation rig within the hostapplication. For instance, one or more functions may include a scalingfunction to selectively scale a rendered object. The one or modulesinclude may a module that is limited to receiving one or morefixed-length variables.

The example method may further including converting variable length datatypes to be input into the one or more modules into fixed-length datatypes in advance of providing the data types as input arguments into theone or more modules.

The one or more modules may include a hierarch of modules, and mayemploy middleware or integration software (e.g., Application ProgrammingInterfaces (APIs) middleware for facilitating use of functionalityprovided by the one or more modules.

The integration software may include an interpreter that is integratedwith one or more host applications. The interpreter may be configured tointerpret and compile C++, e.g., using Just-In-Time (JIT) compilation.

The plugin or add-in may further employ one or more modules to exposeuser versioning control of modules via the one or more hostapplications. An API may facilitate exposing functionality of the one ormore modules to the one or more host applications.

The example method 30 may further specify the selective restriction ofuse of a given process to run on a Graphics Processing Unit (GPU) or aCentral Processing Unit (CPU).

Another example method includes receiving a command to execute theevaluation logic, wherein the evaluation logic includes at least twodata structures that would be stored noncontiguously (discontiguously)in a memory by a compiler; modifying a reference to at least one of thetwo data structures so that the two data structures are storedcontiguously in the memory; storing the data structures in associationwith a computing object that implements at least a portion of theevaluation logic; integrating one or more modules associated with thecomputing object with one or more host applications, wherein the one ormore host applications includes an animation software package; andimplementing the evaluation logic by executing the computing objectusing the two data structures in contiguous memory.

Another example method includes the following steps: receiving a commandto execute the evaluation logic, wherein the evaluation logic includesat least two data structures that would be stored discontiguously in amemory by a compiler; modifying a reference to at least one of the twodata structures so that the two data structures are stored contiguouslyin the memory; storing the data structures in association with acomputing object that implements at least a portion of the evaluationlogic; integrating one or more modules associated with the computingobject with one or more host applications, wherein the one or more hostapplications includes an animation software package; and implementingthe evaluation logic by executing the computing object using the twodata structures in contiguous memory, and the animation software packageto cause an animation of the animation control rig.

This method may further specify that the one or more modules include oneor more functions usable via the host application. The example methodmay further include providing a UI widget with one or more UI controlsfor enabling user control over functionality and use of the one or morefunctions by the host application.

The one or more functions may include one or more evaluators and controllogic for selective manipulation of an animation rig within the hostapplication.

The one or more functions may include a scaling function to selectivelyscale a rendered object. The one or more functions may further include arotation function to selectively rotate a rendered object, and/or atranslation function to selectively translate a rendered object.

The one or modules may further include a module that is limited toreceiving one or more fixed-length variables.

The example method may further including converting variable length datatypes to be input into the one or more modules into fixed-length datatypes in advance of providing the data types as input arguments into theone or more modules.

The example method may further specify that the one or more modules areimplemented via one or more flat files in the portion of contiguousmemory. The one or more modules may include a hierarchy of modules.

The one or more modules may include integration software forfacilitating use of functionality provided by the one or more modules.The integration software may include a compiler enabling Just-In-Time(JIT) compilation of one or more processes for use by the hostapplication. The compiler may be (and/or include) a C++ compiler.

Another example method includes the following steps: receiving a commandto execute the evaluation logic to manipulate the animation control rig,wherein the evaluation logic includes at least two data structures thatwould be stored noncontiguously in one or more memories; modifying astoring of at least one of the two data structures so that the two datastructures are selectively stored in cache memory to reduce data accesstime to within a time reduction threshold (as may vary depending uponapplication-specific implementations); storing the data structures inassociation with a computing object that implements at least a portionof the evaluation logic; integrating one or more modules associated withthe computing object with one or more host applications, wherein the oneor more host applications includes an animation software package; andimplementing the evaluation logic by executing the computing objectusing the two data structures in approximately contiguous memory, andthe animation software package, to cause an animation of the animationcontrol rig.

The step of modifying may further include modifying a storing of atleast one of the two data structures so that the two data structures arestored in minimal (or close) proximity in cache address memory (e.g.,cache memory identified by a particular memory address) that is within aproximity threshold (e.g., a spatial or temporal threshold as measuredmy memory-location address distances as a function of memory locationand/or time to access the memory location), whereby the data structuresexhibit increased cache locality relative to initial storage locations.

The two data structures may include skeleton data associated with ananimation control rig, wherein the skeleton data is represented by, orcharacterized by, the two data structures, which include one or moretransform matrices.

The two data structures may include skeleton data associated withmultiple animation control rigs or puppets associated with a particularscene.

The skeleton data may be represented by the two data structures, whichmay include one or more transform matrices.

The one or more modules may include one or more functions that areusable by the host application. The one or more functions may include afunction to perform one or more kinematics or inverse kinematicsoperations, whereby one or more inputs to the function include positionor orientation of one or more features of an animation control rig.

The example method may further include providing a UI widget with one ormore UI controls for enabling user control over functionality and use ofthe one or more functions by the host application. The one or morefunctions may include one or more evaluators and control logic forselective manipulation of an animation rig within the host application.The one or more functions include a scaling function, translationfunction, rotation function, and/or other function to selectively adjustor manipulate a rendered object.

FIG. 12 illustrates an example computing environment 40 that includes anadd-in (also called a plugin) 44 to a host application 42. The add-in 44includes or leverages functionality for retrieving, collecting, andorganizing data structures 56, 60, 66 or selected portions thereof, inlocal cache memory 46, thereby facilitating fast access to the data byfunctionality of the add-in 44.

For instance, the add-in 44 may leverage an interpreter, middleware, andother integration functionality to facilitate interfacing the add-in 44with the host application 42; for communicating with remote computingresources 54-66; organizing data structures (e.g., an assembled datastructure 48) in cache memory 46, and so on.

In the present implementation, the host application 42 represents acomputer animation software package that incorporates functionality formanipulating animation control rigs. The add-in 44 also providesprocesses, e.g., functions or evaluators, for manipulating, e.g.,transforming animation control rigs. Example processes includetranslating, scaling, rotating, skinning, and so on.

These processes use and/or otherwise operate on data pertaining to theanimation control rig and/or associated scene. The data may represent,for instance, a transformation matrix or portion thereof. This data maybe stored in data structures, which may be local (e.g., stored on thesame computer as used to run the host application 42) or remote.Examples of remote data structures include first data structure 56stored on a remote database 54. The remote database 54 may bemaintained, for instance, on a Solid-State Drive (SSD).

A second example data structure 60 represents a cloud-based datastructure on a cloud 58. The cloud 58 may include one or more serversthat the client-side add-in 44 may communicate with, so as to retrievedata of the second data structure 60 or portion thereof, for use by oneor more processes of the add-in 44 and/or host application 42.

A third example data structure 66 is stored in a Graphics ProcessingUnit (GPU) memory 64 of a GPU 62.

In operation, the add-in 44 selectively searches for and retrieves data,e.g., transformation matrices of the data structures 56, 60, 66 for useby a particular function or evaluator, e.g., a transformation functionused to manipulate an animation control rig. The data structures 565,60, 66, or selected portions thereof, are retrieved by the add-in 44;then temporarily stored in local Random Access Memory 50, as representedby data structures 52.

During execution of a particular function or evaluator, the add-in 44ensures that data structures 52 from the RAM 50 are optimally retrievedfrom RAM 50 and assembled in cache memory 46, as represented by anassembled data structure 48. Note that all or portions of the assembleddata structure 48 may be stored in contiguous or approximatelycontiguous memory blocks in the cache memory 46 and/or in RAM 50. Thisresults in rapid access, by functions of the add-in 44, to data of theassembled data structure 48. This may greatly improve processing speedswhen using the add-in 44 to manipulate animation control rigs.

Operations of processes described herein can be performed in anysuitable order unless otherwise indicated herein or otherwise clearlycontradicted by context. Processes described herein (or variationsand/or combinations thereof) may be performed under the control of oneor more computer systems configured with executable instructions and maybe implemented as code (e.g., executable instructions, one or morecomputer programs or one or more applications) executing collectively onone or more processors, by hardware or combinations thereof. The codemay be stored on a computer-readable storage medium, for example, in theform of a computer program comprising a plurality of instructionsexecutable by one or more processors. The computer-readable storagemedium may be non-transitory.

Conjunctive language, such as phrases of the form “at least one of A, B,and C,” or “at least one of A, B and C,” unless specifically statedotherwise or otherwise clearly contradicted by context, is otherwiseunderstood with the context as used in general to present that an item,term, etc., may be either A or B or C, or any nonempty subset of the setof A and B and C. For instance, in the illustrative example of a sethaving three members, the conjunctive phrases “at least one of A, B, andC” and “at least one of A, B and C” refer to any of the following sets:{A}, {B}, {C}, {A, B}, {A, C}, {B, C}, {A, B, C}. Thus, such conjunctivelanguage is not generally intended to imply that certain implementationsrequire at least one of A, at least one of B and at least one of C eachto be present.

The use of any and all examples, or exemplary language (e.g., “such as”)provided herein, is intended merely to better illuminate implementationsof the invention and does not pose a limitation on the scope of theinvention unless otherwise claimed. No language in the specificationshould be construed as indicating any non-claimed element as essentialto the practice of the invention.

In the foregoing specification, implementations of the invention havebeen described with reference to numerous specific details that may varyfrom implementation to implementation. The specification and drawingsare, accordingly, to be regarded in an illustrative rather than arestrictive sense. The sole and exclusive indicator of the scope of theinvention, and what is intended by the applicants to be the scope of theinvention, is the literal and equivalent scope of the set of claims thatissue from this application, in the specific form in which such claimsissue, including any subsequent correction.

Further implementations can be envisioned to one of ordinary skill inthe art after reading this disclosure. In other implementations,combinations or sub-combinations of the above-disclosed invention can beadvantageously made. The example arrangements of components are shownfor purposes of illustration and it should be understood thatcombinations, additions, re-arrangements, and the like are contemplatedin alternative implementations of the present invention. Thus, while theinvention has been described with respect to exemplary implementations,one skilled in the art will recognize that numerous modifications arepossible.

For example, the processes described herein may be implemented usinghardware components, software components, and/or any combinationthereof. The specification and drawings are, accordingly, to be regardedin an illustrative rather than a restrictive sense. It will, however, beevident that various modifications and changes may be made thereuntowithout departing from the broader spirit and scope of the invention asset forth in the claims and that the invention is intended to cover allmodifications and equivalents within the scope of the following claims.

All references, including publications, patent applications, andpatents, cited herein are hereby incorporated by reference to the sameextent as if each reference were individually and specifically indicatedto be incorporated by reference and were set forth in its entiretyherein.

What is claimed is:
 1. A computer-implemented method for implementingevaluation logic associated with an animation control rig, the methodcomprising: receiving a command to execute the evaluation logic tomanipulate the animation control rig, wherein the evaluation logicincludes at least two data structures that would be storednoncontiguously in one or more memories; modifying a storing of at leastone of the two data structures so that the two data structures areselectively stored in cache memory to reduce data access time to withina time reduction threshold; storing the data structures in associationwith a computing object that implements at least a portion of theevaluation logic; integrating one or more modules associated with thecomputing object with one or more host applications, wherein: the one ormore host applications includes an animation software package; the oneor more modules include one or more functions usable via one of the oneor more host applications; accepting a signal from a user input deviceto enable user control over use of the one or more functions; convertingvariable length data types to be input into the one or more modules intofixed-length data types in advance of providing the data types as inputarguments into the one or more modules; and implementing the evaluationlogic by executing the computing object using the two data structures incache memory, and the animation software package, to cause an animationof the animation control rig.
 2. The computer-implemented method ofclaim 1, wherein modifying a storing includes modifying a storing of atleast one of the two data structures so that the two data structures arestored in close proximity in cache address memory that is within aproximity threshold, whereby the data structures exhibit increased cachelocality relative to initial storage locations.
 3. Thecomputer-implemented method of claim 1, wherein the two data structuresinclude skeleton data associated with an animation control rig, whereinthe skeleton data is represented by the two data structures, whichinclude one or more transform matrices.
 4. The computer-implementedmethod of claim 3, wherein the two data structures include skeleton dataassociated with multiple animation control rigs associated with aparticular scene.
 5. The computer-implemented method of claim 1, whereinthe skeleton data is represented by the two data structures, whichinclude one or more transform matrices.
 6. The computer-implementedmethod of claim 1, further including selectively restricting connectingone or more Graphics Processing Unit (GPU) variables with a functionrunning on a Central Processing Unit (CPU).
 7. The computer-implementedmethod of claim 1, wherein the one or more functions include a functionto perform one or more kinematics or inverse kinematics operations,whereby one or more inputs to the function include position ororientation of one or more features of an animation control rig.
 8. Thecomputer-implemented method of claim 1, further including providing a UIwidget with one or more UI controls for enabling user control overfunctionality and use of the one or more functions by the hostapplication.
 9. The computer-implemented method of claim 1, wherein theone or more functions include one or more evaluators and control logicfor selective manipulation of an animation rig within the hostapplication.
 10. The computer-implemented method of claim 1, wherein theone or more functions include a scaling function to selectively scale arendered object.
 11. The computer-implemented method of claim 1, whereinthe one or more functions include a rotation function to selectivelyrotate a rendered object.
 12. The computer-implemented method of claim1, wherein the one or more functions include a translation function toselectively translate a rendered object.
 13. The computer-implementedmethod of claim 1, further including using the one or more modules toexpose user versioning control of modules via the one or more hostapplication.
 14. The computer-implemented method of claim 1, furtherincluding converting variable length data types to be input into the oneor more modules into fixed-length data types in advance of providing thedata types as input arguments into the one or more modules.
 15. Thecomputer-implemented method of claim 1, wherein the one or more modulesare implemented via one or more flat files in the portion of contiguousmemory.
 16. The computer-implemented method of claim 15, wherein the oneor more modules includes a hierarchy of modules.
 17. Thecomputer-implemented method of claim 16, wherein the one or more modulesincludes integration software for facilitating use of functionalityprovided by the one or more modules.
 18. The computer-implemented methodof claim 17, wherein the integration software includes a compilerenabling Just-In-Time (JIT) compilation of one or more processes for useby the host application.
 19. An apparatus implementing thecomputer-implemented method of claim
 1. 20. A non-transitory mediumincluding machine-executable instructions to implement thecomputer-implemented method of claim 1.